Constant-Weight Gray Codes for Local Rank Modulation
نویسندگان
چکیده
منابع مشابه
Index system and separability of constant weight Gray codes
1229 compression of files of information retrieval systems. With this application in mind, bounds on the average codelength of an alphabetical code were studied. The major results of this correspondence are as follows. 1) A necessary and sufficient condition for the existence of a 2) An upper bound for Lopt (the average codelength of the binary alphabetical code was given. optimal alphabetical ...
متن کاملOn Rank Modulation Codes
We survey rank modulation codes based on a recent result by Mazumdar, Barg and Zemor [MBZ13]. The main results are explicit constructions of rank modulation codes that approach the bounds given by Barg and Mazumdar [BM10].
متن کاملOptimal Constant Weight Codes
A new class of binary constant weight codes is presented. We establish new lower bound and exact values on A(n, 2k, k + 1), in particular, A(30, 12, 7) = 9, A(48, 16, 9) = 11, A(51,16, 9) = 12, A(58, 18, 10) = 12. An ( ) w d n , , constant weight binary code is a code of length n , code distance d in which all code words have the same number of “ones” . The number of “ones” is w . We will denot...
متن کاملConstant-Weight Array Codes
Binary constant-weight codes have been extensively studied, due to both their numerous applications and to their theoretical significance. In particular, constant-weight codes have been proposed for error correction in store and forward. In this paper, we introduce constant-weight array codes (CWACs), which offer a tradeoff between the rate gain of general constant-weight codes and the low deco...
متن کاملTernary Constant Weight Codes
Let A3(n, d,w) denote the maximum cardinality of a ternary code with length n, minimum distance d, and constant Hamming weight w. Methods for proving upper and lower bounds on A3(n, d,w) are presented, and a table of exact values and bounds in the range n ≤ 10 is given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2011
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2011.2162570